Convex and concave relaxations of implicit functions
نویسندگان
چکیده
منابع مشابه
Differentiable McCormick relaxations
McCormick’s classical relaxation technique constructs closed-form convex and concave relaxations of compositions of simple intrinsic functions. These relaxations have several properties which make them useful for lower bounding problems in global optimization: they can be evaluated automatically, accurately, and computationally inexpensively, and they converge rapidly to the relaxed function as...
متن کاملSome results on the strength of relaxations of multilinear functions
We study approaches for obtaining convex relaxations of global optimization problems containing multilinear functions. Specifically, we compare the concave and convex envelopes of these functions with the relaxations that are obtained with a standard relaxation approach, due to McCormick. The standard approach reformulates the problem to contain only bilinear terms and then relaxes each term in...
متن کاملExistence and multiplicity of nontrivial solutions for $p$-Laplacian system with nonlinearities of concave-convex type and sign-changing weight functions
This paper is concerned with the existence of multiple positive solutions for a quasilinear elliptic system involving concave-convex nonlinearities and sign-changing weight functions. With the help of the Nehari manifold and Palais-Smale condition, we prove that the system has at least two nontrivial positive solutions, when the pair of parameters $(lambda,mu)$ belongs to a c...
متن کاملMultivariate McCormick relaxations
McCormick (Math Prog 10(1):147–175, 1976) provides the framework for convex/concave relaxations of factorable functions, via rules for the product of functions and compositions of the form F◦ f , where F is a univariate function. Herein, the composition theorem is generalized to allowmultivariate outer functions F , and theory for the propagation of subgradients is presented. The generalization...
متن کاملLogic-Based Methods for Global Optimization
Abstract. Logic-based methods provide a strategy for applying convex nonlinear programming to nonconvex global optimization. Such methods assume that the problem becomes convex when selected variables are fixed. The selected variables must be discrete, or else discretized if they are continuous. We provide a tutorial survey of disjunctive programming with convex relaxations, logic-based outer a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Optimization Methods and Software
دوره 30 شماره
صفحات -
تاریخ انتشار 2015